/**
 * Created with IntelliJ IDEA.
 * Description:
 * Date: 2025-06-18
 * Time: 17:53
 */
//力扣35.搜索插入位置
class Solution {
    public int searchInsert(int[] nums, int target) {
        //二分左端点
        int left = 0;
        int right = nums.length - 1;

        while (left < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] < target) {
                left = mid + 1;
            }else {
                right = mid;
            }
        }

        if (nums[left] < target) {
            return left + 1;
        }else {
            return left;
        }


        //二分右端点
        /* int left = 0;
        int right = nums.length - 1;

        while (left < right) {
            int mid = left + (right - left + 1) / 2;
            if (nums[mid] <= target) {
                left = mid;
            }else {
                right = mid - 1;
            }
        }
        if (nums[left] >= target) {
            return left;
        }else {
            return left + 1;
        }*/
    }
}
